首页> 外文OA文献 >Factorized Sub-Space Estimation for Fast and Memory Effective I-vector Extraction
【2h】

Factorized Sub-Space Estimation for Fast and Memory Effective I-vector Extraction

机译:用于快速有效存储I向量的因子分解子空间估计

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Most of the state-of-the-art speaker recognition systems use a compact representation of spoken utterances referred to as i-vector. Since the "standard" i-vector extraction procedure requires large memory structures and is relatively slow, new approaches have recently been proposed that are able to obtain either accurate solutions at the expense of an increase of the computational load, or fast approximate solutions, which are traded for lower memory costs. We propose a new approach particularly useful for applications that need to minimize their memory requirements. Our solution not only dramatically reduces the memory needs for i-vector extraction, but is also fast and accurate compared to recently proposed approaches. Tested on the female part of the tel-tel extended NIST 2010 evaluation trials, our approach substantially improves the performance with respect to the fastest but inaccurate eigen-decomposition approach, using much less memory than other methods
机译:大多数最新的说话人识别系统都使用称为i-vector的语音的紧凑表示。由于“标准” i向量提取过程需要大的存储结构并且相对较慢,因此最近提出了新的方法,该方法能够以增加计算量为代价获得准确的解,或者能够获得快速的近似解。以较低的内存成本进行交易。我们提出了一种新方法,该方法对于需要最小化其内存需求的应用程序特别有用。与最近提出的方法相比,我们的解决方案不仅大大减少了i向量提取的内存需求,而且还快速而准确。经过teltel扩展的NIST 2010评估试验中女性部分的测试,我们的方法相对于最快但不准确的特征分解方法而言,显着提高了性能,使用的内存比其他方法少得多

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号